Quasi M-convex and L-convex functions—quasiconvexity in discrete optimization
نویسندگان
چکیده
منابع مشابه
Quasi M-convex and L-convex functions--quasiconvexity in discrete optimization
We introduce two classes of discrete quasiconvex functions, called quasi M-convex and L-convex functions, by generalizing the concepts of M-convexity and L-convexity due to Murota (1996, 1998). We investigate the structure of quasi M-convex and L-convex functions with respect to level sets, and show that various greedy algorithms work for the minimization of quasi M-convex and L-convex function...
متن کاملL-convex Functions and M-convex Functions
In the field of nonlinear programming (in continuous variables) convex analysis [22, 23] plays a pivotal role both in theory and in practice. An analogous theory for discrete optimization (nonlinear integer programming), called " discrete convex analysis " [18, 17], is developed for L-convex and M-convex functions by adapting the ideas in convex analysis and generalizing the results in matroid ...
متن کاملConvex Discrete Optimization
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial optimization problems and convex integer programming problems in variable dimension. We discuss some of the many applications of this theory including to quadratic prog...
متن کاملCategory and subcategories of (L,M)-fuzzy convex spaces
Inthispaper, (L,M)-fuzzy domain finiteness and (L,M)-fuzzy restricted hull spaces are introduced, and several characterizations of the category (L,M)-CS of (L,M)-fuzzy convex spaces are obtained. Then, (L,M)-fuzzy stratified (resp. weakly induced, induced) convex spaces are introduced. It is proved that both categories, the category (L,M)-SCS of (L,M)-fuzzy stratified convex spaces and the cate...
متن کاملM-convex and L-convex Fuctions over the Real Space
By extracting combinatorial structures in well-solved nonlinear combinatorial optimization problems, Murota (1996,1998) introduced the concepts of M-convexity and L-convexity to functions defined over the integer lattice. Recently, Murota–Shioura (2000, 2001) extended these concepts to polyhedral convex functions and quadratic functions defined over the real space. In this paper, we consider a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00468-7